Efficient View Point Selection for Silhouettes of Convex Polyhedra
نویسندگان
چکیده
Silhouettes of polyhedra are an important primitive in application areas such as machine vision and computer graphics. In this paper, we study how to select view points of convex polyhedra such that the silhouette satisfies certain properties. Specifically, we give algorithms to find all projections of a convex polyhedron such that a given set of edges, faces and/or vertices appear on the silhouette. We present an algorithm to solve this problem in O(k2) time for k edges. For orthogonal projections, we give an improved algorithm that is fully adaptive in the number l of connected components formed by the edges, and has a time complexity of O(k log k+kl). We then generalize this algorithm to edges and/or faces appearing on the silhouette. Preprint submitted to Elsevier Science 9 December 2010
منابع مشابه
Geometric Interpretation and Comparisons of Enhancements of GJK Algorithm for Computing Euclidean Distance Between Convex Polyhedra
The computation of Euclidean distance between two convex polyhedra is an important problem in robotics, computer graphics and real-time animation. An efficient and reliable distance computation procedure for a pair of convex sets is developed by Gilbert, Johnson and Keerthi (GJK) in 1988. GJK’s convex set-theoretic approach is general and suitable for iterative numerical computation, however th...
متن کاملAutomata-Based Symbolic Representations of Polyhedra
This work describes a data structure, the Implicit Real-Vector Automaton (IRVA), suited for representing symbolically polyhedra, i.e., regions of n-dimensional space defined by finite Boolean combinations of linear inequalities. IRVA can represent exactly arbitrary convex and non-convex polyhedra, including features such as open and closed boundaries, unconnected parts, and non-manifold compone...
متن کاملThe Stochastic Modelling of Trees
We present here a fast method for the modelling of trees which brings together two interesting techniques. The trees are modelled as convex polyhedra for the description of the gross. shape, and threedimensional texture mapping is used for the detailed features. The "essential" volume of the tree is represented as the convex intersection of half spaces. The advantage of this representation is t...
متن کاملExact join detection for convex polyhedra and other numerical abstractions
Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification and optimization of hardware and software systems. In such application fields though, general convex polyhedra are just one among many, so-called, numerical a...
متن کاملCauchy's Theorem and Edge Lengths of Convex Polyhedra
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in particular the edge lengths and dihedral angles of the polyhedron. Cauchy’s rigidity theorem of 1813 states that the dihedral angles are uniquely determined. Finding them is a significant algorithmic problem which we ex...
متن کامل